The problem of information weak consistency must be considered by the load balancing algorithm whn it performs schedu1ing . in order to using the weak consistency information effectively , we propose a smallest k - subset random algoritlun ( skr and conduct a lot of simulation 為了有效利用系統(tǒng)中的弱一致性信息,使之成為負國防科學技術大學研究生院學位論文載平衡調(diào)度的決策依據(jù),我們提出了一種基于信息弱一致性模型的最小k子集隨機算法,并進行了性能模擬分析。